package com.判断二叉搜索树的后序遍历;

public class Test {

	public static void main(String[] args) {
		Solution s = new Solution();
		int []a = {5,7,6,9,11,10,8};
		boolean end = s.VerifySquenceOfBST(a);
		System.out.println(end);
	}

}
